The capacitated general windy routing problem with turn penalties
نویسندگان
چکیده
منابع مشابه
The mixed capacitated general routing problem with turn penalties
0957-4174/$ see front matter 2011 Elsevier Ltd. A doi:10.1016/j.eswa.2011.04.092 ⇑ Corresponding author. Tel.: +34963877007x7666 E-mail addresses: [email protected] (O. Bräy Martínez), [email protected] (Y. Nagata), dsole In this paper we deal with the mixed capacitated general routing problem with turn penalties. This problem generalizes many important arc and node routing proble...
متن کاملA parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments
We prove that any polynomial-time α(n)-approximation algorithm for the n-vertex metric asymmetric Traveling Salesperson Problem yields a polynomial-time O(α(C))-approximation algorithm for the mixed and windy Capacitated Arc Routing Problem, where C is the number of weakly connected components in the subgraph induced by the positive-demand arcs—a small number in many applications. In conjunctio...
متن کاملThe mixed capacitated general routing problem under uncertainty
We study the General Routing Problem defined on a mixed graph and with stochastic demands. The problem under investigation is aimed at finding the minimum cost set of routes to satisfy a set of clients whose demand is not deterministically known. Since each vehicle has a limited capacity, the demand uncertainty occurring at some clients affects the satisfaction of the capacity constraints, that...
متن کاملApproximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems
We show that any α(n)-approximation algorithm for the n-vertex metric asymmetric Traveling Salesperson problem yields O(α(C))-approximation algorithms for various mixed, windy, and capacitated arc routing problems. Herein, C is the number of weakly-connected components in the subgraph induced by the positive-demand arcs, a number that can be expected to be small in applications. In conjunction ...
متن کاملA matheuristic algorithm for the mixed capacitated general routing problem
We study the general routing problem de ned on a mixed graph and subject to capacity constraints. Such a problem aims to nd the set of routes of minimum overall cost servicing a subset of required elements like vertices, arcs and edges, without exceeding the capacity of a eet of homogeneous vehicles based at the same depot. The problem is a generalization of a large variety of node and arc rout...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2011
ISSN: 0167-6377
DOI: 10.1016/j.orl.2011.04.007